Slice‐torus link invariants, combinatorial invariants and positivity conditions

We prove some necessary conditions for a link to be either concordant quasi-positive link, quasi-positive, positive or the closure of braid. The main applications our results are characterisation links with unlinking numbers 1 and 2, combinatorial criterion test if is Finally, we compile table all positive-braid prime less than 8 crossings.